Class Notes and Examples
May

 

• Monday, May 2 Introduction to Graphs
• Wednesday, May 4 Shortest paths in unweighted graphs
• Friday, May 6 Exam 2
  Monday, May 9 No class
• Wednesday, May 11 About Lab 9
• Friday, May 13: Shortest Paths with Positive Weights (Dijkstra's algorithm) and negative weights (Bellman-Ford algorithm)
• Monday, May 16: Activity graphs
• Wednesday, May 18: Sorting
• Friday, May 20: How fast can we Sort? Dynamic Programming
• Monday, May 23: More Dynamic Programming
• Wednesday, May 25: Review